# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def reachingPoints(self, sx: int, sy: int, tx: int, ty: int) -> bool:
        if tx < sx or ty < sy:
            return False
        if tx > ty:
            # 说明ty不会再变化了，tx只能是 n * ty + sx
            if sy == ty:
                if (tx - sx) % ty == 0:
                    return True
                else:
                    return False
            else:
                return self.reachingPoints(sx, sy, tx % ty, ty)
        elif tx < ty:
            # 说明tx不会再变化了，ty只能是 n * tx + sy
            if sx == tx:
                if (ty - sy) % tx == 0:
                    return True
                else:
                    return False
            else:
                return self.reachingPoints(sx, sy, tx, ty % tx)
        else:
            return sx == tx and sy == ty


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (1, 1, 3, 5, True),
        (1, 1, 2, 2, False),
        (1, 1, 1, 1, True)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        input3 = case_item[2]
        input4 = case_item[3]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.reachingPoints(input1, input2, input3, input4)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

